On Randomized Broadcasting in Power Law Networks
نویسنده
چکیده
Broadcasting algorithms have various range of applications in different fields of computer science. In this paper we consider randomized broadcasting algorithms in power law graphs which are often used to model large scale real world networks such as the Internet. We prove that for certain (truncated) power law networks there exists a time efficient randomized broadcasting algorithm whose communication complexity is bounded by an asymptotically optimal value. In order to describe these power law graphs, we first consider the generalized random graph model G(d) = (V,E), where d = (d1, . . . , dn) is a given sequence of expected degrees, and two nodes vi, vj ∈ V share an edge in G(d) with probability pi,j = didj/ n k=1 dk, independently [7]. We show for these graphs that if the expected minimal degree dmin is larger than log n, δ > 2, and the number of nodes with expected degree di is proportional to (di − dmin+1)−β , where β > 2 is a constant, then a simple randomized broadcasting protocol exists, which spreads any information r to all nodes of a graph G(d) within O(log n) steps by using at most O(nmax{log log n, log n/ log dmin}) transmissions. Furthermore, we discuss the applicability of our methods in more general power law graph models. Please note that our results hold with probability 1 − 1/n, even if n and d are completely unknown to the nodes of the graph. The algorithm we present in this paper uses a very simple communication rule, and can efficiently handle restricted node failures or dynamical changes in the size of the network. In addition, our methods might be useful for further research in this field.
منابع مشابه
On Radio Broadcasting in Random Geometric Graphs
One of the most frequently studied problems in the context of information dissemination in communication networks is the broadcasting problem. In this paper we consider radio broadcasting in random geometric graphs, in which n nodes are placed uniformly at random in [0, √ n], and there is a (directed) edge from a node u to a node v in the corresponding graph iff the distance between u and v is ...
متن کاملA Cluster-Based Hybrid broadcasting mechanism for Quantum Systems with Power Management and delay Constraint in the MAC sub-layer
متن کامل
Free Vibrations of Three-Parameter Functionally Graded Plates Resting on Pasternak Foundations
In this research work, first, based on the three-dimensional elasticity theory and by means of the Generalized Differential Quadrature Method (GDQM), free vibration characteristics of functionally graded (FG) rectangular plates resting on Pasternak foundation are focused. The two-constituent functionally graded plate consists of ceramic and metal grading through the thickness. A three-parameter...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملThe need to create a media block for the convergence of overseas news networks
As a general diplomacy arm of the Islamic Republic of Iran, VoSiMa has extensive activities in international broadcasting of its radio and television programs. These programs are broadcast in different languages, such as English, French, Azeri, Arabic, and ... for regional and transnational audiences. The large volume of the organization's international activities is in the form of news and new...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006